Tingley's problems on uniform algebras
نویسندگان
چکیده
We prove that a surjective isometry between the unit spheres of two uniform algebras is extended to real-linear algebras. It provides first positive solution Tingley's problem on Banach space, without being Hilbert consisting analytic functions.
منابع مشابه
Uniform Algebras on Curves
The proofs use the notion of analytic structure in a maximal ideal space. J. Wermer first obtained results along these lines and further contributions were made by E. Bishop and H. Royden and then by G. Stolzenberg [5] who proved STOLZENBERG'S THEOREM. Let XQC be a polynomially convex set. Let KQC be a finite union of Q-curves. Then (XKJK)*—X\JK is a {possibly empty) pure 1-dimensional analytic...
متن کاملM-IDEAL STRUCTURE IN UNIFORM ALGEBRAS
It is proved that if A is aregular uniform algebra on a compact Hausdorff space X in which every closed ideal is an M-ideal, then A = C(X).
متن کاملOn uniform k-partition problems
We study various uniform k-partition problems which consist in partitioning m sets, each of cardinality k, into k sets of cardinality m such that each of these sets contains exactly one element from every original set. The problems differ according to the particular measure of “set uniformity” to be optimized. Most problems are polynomial and corresponding solution algorithms are provided. A fe...
متن کاملSurjective Real-Linear Uniform Isometries Between Complex Function Algebras
In this paper, we first give a description of a surjective unit-preserving real-linear uniform isometry $ T : A longrightarrow B$, where $ A $ and $ B $ are complex function spaces on compact Hausdorff spaces $ X $ and $ Y $, respectively, whenever ${rm ER}left (A, Xright ) = {rm Ch}left (A, Xright )$ and ${rm ER}left (B, Yright ) = {rm Ch}left (B, Yright )$. Next, we give a description of $ T...
متن کاملTurán Problems on Non-Uniform Hypergraphs
A non-uniform hypergraph H = (V,E) consists of a vertex set V and an edge set E ⊆ 2V ; the edges in E are not required to all have the same cardinality. The set of all cardinalities of edges in H is denoted by R(H), the set of edge types. For a fixed hypergraph H, the Turán density π(H) is defined to be limn→∞maxGn hn(Gn), where the maximum is taken over all H-free hypergraphs Gn on n vertices ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2021
ISSN: ['0022-247X', '1096-0813']
DOI: https://doi.org/10.1016/j.jmaa.2021.125346